Prefixed Tableaux Systems for Modal Logics with Enriched Languages

نویسندگان

  • Philippe Balbiani
  • Stéphane Demri
چکیده

We present sound and complete prefixed tableaux systems for various modal logics with enriched languages including the "difference" modal operator ] and the "only if" modal operator [—R]. These logics are of special interest in Art i f icial Intelligence since their expressive power is higher than the standard modal logics and for most of them the satisfiability problem remains decidable. We also include in the paper decision procedures based on these systems. In the conclusion, we relate our work with similar ones from the literature and we propose exten­ sions to other logics.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tableau-based Decision Procedures for Hybrid Logic

Hybrid logics are a principled generalization of both modal logics and description logics. It is well-known that various hybrid logics without binders are decidable, but decision procedures are usually not based on tableau systems, a kind of formal proof procedure that lends itself towards computer implementation. In this paper we give four different tableaubased decision procedures for a very ...

متن کامل

Implementing and Evaluating Provers for First-order Modal Logics

While there is a broad literature on the theory of firstorder modal logics, little is known about practical reasoning systems for them. This paper presents several implementations of fully automated theorem provers for first-order modal logics based on different proof calculi. Among these calculi are the standard sequent calculus, a prefixed tableau calculus, an embedding into simple type theor...

متن کامل

Combining Deduction and Model Checking into Tableaux and Algorithms for Converse-PDL

This paper presents a prefixed tableaux calculus for Propositional Dynamic Logic with Converse based on a combination of different techniques such as prefixed tableaux for modal logics and model checkers for +-calculus. We prove the correctness and completeness of the calculus and illustrate its features. We also discuss the transformation of the tableaux method (naively NEXPTIME) into an EXPTI...

متن کامل

Certification of Prefixed Tableau Proofs for Modal Logic

Different theorem provers tend to produce proof objects in different formats and this is especially the case for modal logics, where several deductive formalisms (and provers based on them) have been presented. This work falls within the general project of establishing a common specification language in order to certify proofs given in a wide range of deductive formalisms. In particular, by usi...

متن کامل

Prefixed tableaus and nested sequents

Nested sequent systems for modal logics are a relatively recent development, within the general area known as deep reasoning. The idea of deep reasoning is to create systems within which one operates at lower levels in formulas than just those involving the main connective or operator. Prefixed tableaus go back to 1972, and are modal tableau systems with extra machinery to represent accessibili...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997